The distinguishing number and the distinguishing index of line and graphoidal graph(s)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distinguishing number and distinguishing index of natural and fractional powers of graphs

‎The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$‎ ‎such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial‎ ‎automorphism‎. ‎For any $n in mathbb{N}$‎, ‎the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...

متن کامل

The distinguishing chromatic number of bipartite graphs of girth at least six

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

متن کامل

The Distinguishing Index of Infinite Graphs

The distinguishing index D′(G) of a graph G is the least cardinal d such that G has an edge colouring with d colours that is only preserved by the trivial automorphism. This is similar to the notion of the distinguishing number D(G) of a graph G, which is defined with respect to vertex colourings. We derive several bounds for infinite graphs, in particular, we prove the general bound D′(G) 6 ∆(...

متن کامل

The Distinguishing Chromatic Number of Kneser Graphs

A labeling f : V (G) → {1, 2, . . . , d} of the vertex set of a graph G is said to be proper d-distinguishing if it is a proper coloring of G and any nontrivial automorphism of G maps at least one vertex to a vertex with a different label. The distinguishing chromatic number of G, denoted by χD(G), is the minimum d such that G has a proper d-distinguishing labeling. Let χ(G) be the chromatic nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics

سال: 2020

ISSN: 0972-8600,2543-3474

DOI: 10.1016/j.akcej.2018.08.006